package subject_set.offer100;

/**
 * @author haomin
 * @date 2022/10/27 17:25
 **/
public class Offer68_Ⅱ {
    class Solution {
        public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
            if(root == null) return null;
            if(root == p || root == q) return root;
            TreeNode l = lowestCommonAncestor(root.left, p, q);
            TreeNode r = lowestCommonAncestor(root.right, p, q);
            if(l != null && r != null) return root;
            if(l != null) return l;
            return r;
        }
    }
}